Communication Complexity of Dual Decomposition Methods for Distributed Resource Allocation Optimization

Communication Complexity of Distributed Resource Allocation Optimization

This paper investigates the communication complexity of distributed resource allocation problems. Communication complexity, which has emerged from computer science, measures the minimal number of communicated bits needed to solve some classes of problems regardless of the used algorithm, when the communication is lossless. We introduce two complexity measures for finding primal/dual saddle poin...

Distributed Multi-Agent Optimization via Dual Decomposition

In this master thesis, a new distributed multi-agent optimization algorithm is introduced. The algorithm is based upon the dual decomposition of the optimization problem, together with the subgradient method for finding the optimal dual solution. The convergence of the new optimization algorithm is proved for communication networks with bounded timevarying delays, and noisy communication. Furth...

Analysis of Meta-level Communication for Distributed Resource Allocation Problems

We examine the effects of meta-level-communication in the DSRAP (Distributed Sequential Resource Allocation Problem). In DSRAP, independent tasks are categorized into different types, where each task belonging to a particular task type shares a known distribution of task arrivals, durations, reward rates, maximum waiting times, and resource demands. We first look at a single task type DSRAP (SD...

Resource Allocation for Wireless Networks: A Distributed Optimization Approach

Optimal Distributed Gradient Methods for Network Resource Allocation Problems

We present an optimal distributed gradient method for the Network Utility Maximization (NUM) problem. Most existing works in the literature use (sub)gradient methods for solving the dual of this problem which can be implemented in a distributed manner. However, these (sub)gradient methods suffer from an O(1/ √ k) rate of convergence (where k is the number of iterations). In this paper, we assum...